The Eulerian distribution on centrosymmetric involutions
نویسندگان
چکیده
We present an extensive study of the Eulerian distribution on the set of centrosymmetric involutions, namely, involutions in Sn satisfying the property σ(i) + σ(n+ 1− i) = n+ 1 for every i = 1 . . . n. We find some combinatorial properties for the generating polynomial of such distribution, together with an explicit formula for its coefficients. Afterwards, we carry out an analogous study for the subset of centrosymmetric involutions without fixed points.
منابع مشابه
The Eulerian distribution on self evacuated involutions
We present an extensive study of the Eulerian distribution on the set of self evacuated involutions, namely, involutions corresponding to standard Young tableaux that are fixed under the Schützenberger map. We find some combinatorial properties for the generating polynomial of such distribution, together with an explicit formula for its coefficients. Afterwards, we carry out an analogous study ...
متن کاملTwo Descent Statistics over 321-Avoiding Centrosymmetric Involutions
Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n + 1 − i) = 2n + 1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the ...
متن کاملA ug 2 01 5 Two descent statistics over 321 - avoiding centrosymmetric involutions
Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n+1− i) = 2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum o...
متن کاملThe signed Eulerian numbers on involutions
We de ne an analog of signed Eulerian numbers fn,k for involutions of the symmetric group and derive some combinatorial properties of this sequence. In particular, we exhibit both an explicit formula and a recurrence for fn,k arising from the properties of its generating function.
متن کاملOn the Eulerian Enumeration of Involutions
We consider in this work the enumeration of involutions by descent sets, and based on that, by descent numbers. Formulas of the number of involutions with a prescribed descent set, with a prescribed descent number and Frobenius-type formulas are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 11 شماره
صفحات -
تاریخ انتشار 2009